New LCD MDS Codes of Non-Reed-Solomon Type

نویسندگان

چکیده

Both linear complementary dual (LCD) codes and maximum distance separable (MDS) have good algebraic structures, they interesting practical applications such as communication systems, data storage, quantum codes, so on. So far, most of LCD MDS been constructed by employing generalized Reed-Solomon codes. In this paper we construct some classes new Euclidean Hermitian which are not monomially equivalent to called non-Reed-Solomon type. Our method is based on the constructions Beelen et al. (2017) Roth Lempel (1989). To best our knowledge, first construction type; any code type Carlet (2018).

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A construction of non-Reed-Solomon type MDS codes

We present a construction of long MDS codes which are not of the generalized ReedSolomon (GRS) type. The construction employs subsets S, S = m, of a finite field F = GF(q) with the property that no t distinct elements of S add up to some fixed element of F . Large subsets of this kind are used to construct [n = m + 2, k = t +1] non-GRS MDS codes over F .

متن کامل

New MDS Self-Dual Codes from Generalized Reed-Solomon Codes

Both MDS and Euclidean self-dual codes have theoretical and practical importance and the study of MDS self-dual codes has attracted lots of attention in recent years. In particular, determining existence of q-ary MDS self-dual codes for various lengths has been investigated extensively. The problem is completely solved for the case where q is even. The current paper focuses on the case where q ...

متن کامل

On MDS extensions of generalized Reed-Solomon codes

AbsrructAn ( n, k, d) linear code over F = GF( q) is said to be ntcrximunt dktunce separable (MDS) if d = n k + 1. It is shown that an (II, k, FI k + 1) generalized Reed-Solomon code such that 2 I k 5 n 1 ((I 1)/2] (k + 3 if q is even) can be extended by one digit while preserving the MDS property if and only if the resulting extended code is also a generalized Reed-Solomon code. It follows tha...

متن کامل

New constructions of quantum MDS convolutional codes derived from generalized Reed-Solomon codes

Quantum convolutional codes can be used to protect a sequence of qubits of arbitrary length against decoherence. In this paper, we give two new constructions of quantum MDS convolutional codes derived from generalized Reed-Solomon codes and obtain eighteen new classes of quantum MDS convolutional codes. Most of them are new in the sense that the parameters of the codes are different from all th...

متن کامل

Quantum Reed-Solomon Codes

During the last years it has been shown that computers taking advantage of quantum mechanical phenomena outperform currently used computers. The striking examples are integer factoring in polynomial time (see [8]) and finding pre– images of an n–ary Boolean function (“searching”) in time O( √ 2n) (see [5]). Quantum computers are not only of theoretical nature—there are several suggestions how t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Information Theory

سال: 2021

ISSN: ['0018-9448', '1557-9654']

DOI: https://doi.org/10.1109/tit.2021.3086818